Biased Metropolis-heat-bath Algorithm for Fundamental-adjoint Su(2) Lattice Gauge Theory

نویسندگان

  • Alexei Bazavov
  • Bernd A. Berg
  • Urs M. Heller
چکیده

For SU(2) lattice gauge theory with the fundamental-adjoint action an efficient heat-bath algorithm is not known so that one had to rely on Metropolis simulations supplemented by overrelaxation. Implementing a novel biased Metropolis-heat-bath algorithm for this model, we find improvement factors in the range 1.45 to 2.06 over conventionally optimized Metropolis simulations. If one optimizes further with respect to additional overrelaxation sweeps, the improvement factors are found in the range 1.3 to 1.8.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heat Bath Efficiency with Metropolis-type Updating

We illustrate for 4D SU(2) and U(1) lattice gauge theory that sampling with a biased Metropolis scheme is essentially equivalent to using the heat bath algorithm. Only, the biased Metropolis method can also be applied when an efficient heat bath algorithm does not exist. For the examples discussed the biased Metropolis algorithm is also better suited for parallelization than the heat bath algor...

متن کامل

Biased Metropolis-Heatbath Algorithms for Lattice Gauge Theory

It is illustrated for 4D SU(2) lattice gauge theory that sampling with a biased Metropolis scheme is essentially equivalent to using the heatbath algorithm. Only, the biased Metropolis method can also be applied when an efficient heatbath algorithm does not exist. Other cases for which the use of the biased Metropolis-heatbath algorithm is beneficial are briefly summarized.

متن کامل

Genetic Algorithm for SU(2) Gauge Theory on a 2-dimensional Lattice

A hybrid algorithm is proposed for pure SU(N) lattice gauge theory based on Genetic Algorithms (GA)s and the Metropolis method. We apply the hybrid GA to pure SU(2) gauge theory on a 2-dimensional lattice and find the action per plaquette and Wilson loops being consistent with those given by the Metropolis and Heatbath methods. The thermalization of this newly proposed Hybrid GA is quite faster...

متن کامل

Monte-carlo Simulation of Pure U(n) and Su(n) Latfice Gauge Theories with Fundamental and Adjoint Couplings

Title ofprogram: SUUNFA theories, QED and QCD models, non-perturbative effects, phase transitions, confining and deconfining phases, quark theory, Catalogue number: AAOT statistical mechanical analogies, action per plaquette, Metropolis algorithm, Monte Carlo techniques Program available from: CPC Program Library, Queen’s University of Belfast, N. Ireland (see application form in this issue) Na...

متن کامل

Genetic Algorithm for SU(N) gauge theory on a lattice

An algorithm is proposed for the simulation of pure SU(N) lattice gauge theories based on Genetic Algorithms(GAs). Main difference between GAs and Metropolis methods(MPs) is that GAs treat a population of points at once, while MPs treat only one point in the searching space. This provides GAs with information about the assortment as well as the fitness of the evolution function and producing a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005